On an almost-universal hash function family with applications to authentication and secrecy codes
نویسندگان
چکیده
Universal hashing, discovered by Carter and Wegman in 1979, has many important applications in computer science. The following family, called MMH∗ by Halevi and Krawczyk in 1997, is well known: Let p be a prime and k be a positive integer. Define MMH := {gx : Z k p → Zp | x ∈ Z k p}, where gx(m) := m · x (mod p) = k
منابع مشابه
The power of primes: security of authentication based on a universal hash-function family
Message authentication codes (MACs) based on universal hash-function families are becoming increasingly popular due to their fast implementation. In this paper, we investigate a family of universal hash functions that has been appeared repeatedly in the literature and provide a detailed algebraic analysis for the security of authentication codes based on this universal hash family. In particula...
متن کاملUniversal Hashing and Geometric Codes
We describe a new application of algebraic coding theory to universal hashing and authentication without secrecy. This permits to make use of the hitherto sharpest weapon of coding theory, the construction of codes from algebraic curves. We show in particular how codes derived from Artin-Schreier curves, Hermitian curves and Suzuki curves yield classes of universal hash functions which are subs...
متن کاملRelated-Key Almost Universal Hash Functions: Definitions, Constructions and Applications
Universal hash functions (UHFs) have been extensively used in the design of cryptographic schemes. If we consider the related-key attack (RKA) against these UHF-based schemes, some of them may not be secure, especially those using the key of UHF as a part of the whole key of scheme, due to the weakness of UHF in the RKA setting. In order to solve the issue, we propose a new concept of related-k...
متن کاملUniversal Hash Functions for Emerging Ultra-Low-Power Networks
Message Authentication Codes (MACs) are a valuable tool for ensuring the integrity of messages. MACs may be built around a keyed hash function. In this paper, we propose three variations on NH (a universal hash function explored in UMAC [1]), namely PH, PR and WH. Our main motivation was to prove that universal hash functions can be employed to provide provable security in ultra-low-power appli...
متن کاملUniversal Hashing for Ultra-Low-Power Cryptographic Hardware Applications
Message Authentication Codes (MACs) are valuable tools for ensuring the integrity of messages. MACs may be built around a keyed hash function. Our main motivation was to prove that universal hash functions can be employed as underlying primitives of MACs in order to provide provable security in ultra-low-power applications such as the next generation self-powered sensor networks. The idea of us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2015 شماره
صفحات -
تاریخ انتشار 2015